Malleable coding for updatable cloud caching

In software-as-a-service applications provisioned through cloud computing, locally cached data are often modified with updates from new versions. In some cases, with each edit, one may want to preserve both the original and new versions. In this paper, we focus on cases in which only the latest version must be preserved. Furthermore, it is desirable for the data to not only be compressed but to also be easily modified during updates, since representing information and modifying the representation both incur cost. We examine whether it is possible to have both compression efficiency and ease of alteration, in order to promote codeword reuse. In other words, we study the feasibility of a malleable and efficient coding scheme. The tradeoff between compression efficiency and malleability cost-the difficulty of synchronizing compressed versions-is measured as the length of a reused prefix portion. The region of achievable rates and malleability is found. Drawing from prior work on common information problems, we show that efficient data compression may not be the best engineering design principle when storing software-as-a-service data. In the general case, goals of efficiency and malleability are fundamentally in conflict.This work was supported in part by an NSF Graduate Research Fellowship (LRV), Grant CCR-0325774, and Grant CCF-0729069. This work was presented at the 2011 IEEE International Symposium on Information Theory [1] and the 2014 IEEE International Conference on Cloud Engineering [2]. The associate editor coordinating the review of this paper and approving it for publication was R. Thobaben. (CCR-0325774 - NSF Graduate Research Fellowship; CCF-0729069 - NSF Graduate Research Fellowship)Accepted manuscrip

Malleable Coding with Fixed Reuse

In cloud computing, storage area networks, remote backup storage, and similar settings, stored data is modified with updates from new versions. Representing information and modifying the representation are both expensive. Therefore it is desirable for the data to not only be compressed but to also be easily modified during updates. A malleable coding scheme considers both compression efficiency and ease of alteration, promoting codeword reuse. We examine the trade-off between compression efficiency and malleability cost-the difficulty of synchronizing compressed versions-measured as the length of a reused prefix portion. Through a coding theorem, the region of achievable rates and malleability is expressed as a single-letter optimization. Relationships to common information problems are also described

On palimpsests in neural memory: an information theory viewpoint

The finite capacity of neural memory and the reconsolidation phenomenon suggest it is important to be able to update stored information as in a palimpsest, where new information overwrites old information. Moreover, changing information in memory is metabolically costly. In this paper, we suggest that information-theoretic approaches may inform the fundamental limits in constructing such a memory system. In particular, we define malleable coding, that considers not only representation length but also ease of representation update, thereby encouraging some form of recycling to convert an old codeword into a new one. Malleability cost is the difficulty of synchronizing compressed versions, and malleable codes are of particular interest when representing information and modifying the representation are both expensive. We examine the tradeoff between compression efficiency and malleability cost, under a malleability metric defined with respect to a string edit distance. This introduces a metric topology to the compressed domain. We characterize the exact set of achievable rates and malleability as the solution of a subgraph isomorphism problem. This is all done within the optimization approach to biology framework.Accepted manuscrip

A Novel Design of Multi-Chambered Biomass Battery

In this paper, a novel design of biomass battery has been introduced for providing electricity to meet the lighting requirements of rural household using biomass. A biomass battery is designed, developed and tested using cow dung as the raw material. This is done via anaerobic digestion of the cow dung, and power generation driven by the ions produced henceforth. The voltage and power output is estimated for the proposed system. It is for the first time that such a high voltage is obtained from cow dung fed biomass battery. The output characteristics of this novel battery design have also been compared with the previously designed battery

p-Wave Optical Feshbach Resonances in Yb-171

We study the use of an optical Feshbach resonance to modify the p-wave interaction between ultracold polarized Yb-171 spin-1/2 fermions. A laser exciting two colliding atoms to the 1S_0 + 3P_1 channel can be detuned near a purely-long-range excited molecular bound state. Such an exotic molecule has an inner turning point far from the chemical binding region and thus three-body-recombination in the Feshbach resonance will be highly suppressed in contrast to that typically seen in a ground state p-wave magnetic Feshbach resonance. We calculate the excited molecular bound-state spectrum using a multichannel integration of the Schr\"{o}dinger equation, including an external perturbation by a magnetic field. From the multichannel wave functions, we calculate the Feshbach resonance properties, including the modification of the elastic p-wave scattering volume and inelastic spontaneous scattering rate. The use of magnetic fields and selection rules for polarized light yields a highly controllable system. We apply this control to propose a toy model for three-color superfluidity in an optical lattice for spin-polarized Yb-171, where the three colors correspond to the three spatial orbitals of the first excited p-band. We calculate the conditions under which tunneling and on-site interactions are comparable, at which point quantum critical behavior is possible.Comment: 8 pages, 4 figure

Volatility term structures in commodity markets

In this study, we comprehensively examine the volatility term structures in commodity markets. We model state‐dependent spillovers in principal components (PCs) of the volatility term structures of different commodities, as well as that of the equity market. We detect strong economic links and a substantial interconnectedness of the volatility term structures of commodities. Accounting for intra‐commodity‐market spillovers significantly improves out‐of‐sample forecasts of the components of the volatility term structure. Spillovers following macroeconomic news announcements account for a large proportion of this forecast power. There thus seems to be substantial information transmission between different commodity markets

A stable Algebraic Spin Liquid in a Hubbard model

We show the existence of a stable Algebraic Spin Liquid (ASL) phase in a Hubbard model defined on a honeycomb lattice with spin-dependent hopping that breaks time-reversal symmetry. The effective spin model is the Kitaev model for large on-site repulsion. The gaplessness of the emergent Majorana fermions is protected by the time reversal (TR) invariance of this model. We prove that the effective spin model is TR invariant in the entire Mott phase thus ensuring the stability of the ASL. The model can be physically realized in cold atom systems and we propose experimental signals of the ASL.Comment: Published in PR